Delaunay transformations of a Delaunay polytope
نویسندگان
چکیده
منابع مشابه
How to compute the rank of a Delaunay polytope
Roughly speaking, the rank of a Delaunay polytope (first introduced in [2]) is its number of degrees of freedom. In [3], a method for computing the rank of a Delaunay polytope P using the hypermetrics related to P is given. Here a simpler more efficient method, which uses affine dependencies instead of hypermetrics is given. This method is applied to classical Delaunay polytopes. Then, we give ...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملOn Voronoi-Delaunay Duality and Delaunay Meshes
In this paper, we are concerned with Delaunay triangulations of the vertex set of a piecewise flat (pwf) surface. We first propose the notion of well-formed Voronoi diagrams and establish a precise dual relationship between them and proper Delaunay triangulations on pwf surfaces. Then we provide an algorithm which, given any input manifold triangle mesh, constructs aDelaunay mesh: a manifold tr...
متن کاملDelaunay Supertopes
A perfect inhomogeneous quadratic form is defined by that it can be reconstructed in a unique way from its arithmetic minimum and all integral vectors on which it is attained. Such a form defines an integral Delaunay polytope that has a remarkable property of having a unique circumscribed ellipsoid whose interior is free of integral points. A polytope with this uniqueness property is called a p...
متن کاملPerturbations for Delaunay and weighted Delaunay 3D triangulations
The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron exists in the defined triangulation. The perturbation scheme is easy to code; It is implemented in cg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 1996
ISSN: 0925-9899,1572-9192
DOI: 10.1007/bf00186527